Recurrence in Dense-Time AMS Assertions

نویسندگان

چکیده

The notion of recurrence over continuous or dense time, as required for expressing analog and mixed-signal behaviors, is fundamentally different from what offered by the operators SystemVerilog assertions (SVAs). This article introduces formal semantics time provides a methodology runtime verification such properties using interval arithmetic. Our property language extends SVA with real-time intervals predicates containing real-valued signals. We provide tool kit that interfaces off-the-shelf EDA tools through standard VPI.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deterministic Dynamic Monitors for Linear-Time Assertions

We describe a framework for dynamic verification of temporal assertions based on assertion compilation into deterministic automata. The novelty of our approach is that it allows efficient dynamic verification of general linear temporal formulas written in formal property specification languages such as LTL, ForSpec, PSL, and SVA, while the existing approaches are applicable to limited subsets o...

متن کامل

The Ams Time of Flight System

The Time of Flight (TOF) system of the AMS experiment provides the fast trigger to the detector and measures the crossing particle direction, velocity and charge. AMS was operated aboard of the shuttle Discovery on June 1998 (NASA STS-91 mission) and will be upgraded and installed on the International Space Station at the end of 2003, for 3 years of data taking. The performances of the TOF duri...

متن کامل

Time-Constraint-Aware Optimization of Assertions in Embedded Software

Technology shrinking and sensitization have led to more and more transient faults in embedded systems. Transient faults are intermittent and non-predictable faults caused by external events, such as energetic particles striking the circuits. These faults do not cause permanent damages, but may affect the running applications. One way to ensure the correct execution of these embedded application...

متن کامل

Multiple Recurrence and Finding Patterns in Dense Sets

Szemerédi’s Theorem asserts that any positive-density subset of the integers must contain arbitrarily long arithmetic progressions. It is one of the central results of additive combinatorics. After Szemeredi’s original combinatorial proof, Furstenberg noticed the equivalence of this result to a new phenomenon in ergodic theory that he called ‘multiple recurrence’. Furstenberg then developed som...

متن کامل

Dense Real-Time Games

The rapid development of complex and safety-critical systems requires the use of reliable verification methods and tools for system design (synthesis). Many systems of interest are reactive, in the sense that their behavior depends on the interaction with the environment. A natural framework to model them is a two-player game: the system versus the environment. In this context, the central prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

سال: 2021

ISSN: ['1937-4151', '0278-0070']

DOI: https://doi.org/10.1109/tcad.2020.3040259